Quantum Turing automata
نویسنده
چکیده
A denotational semantics of quantum Turing machines having a quantum control is defined in the dagger compact closed category of finite dimensional Hilbert spaces. Using the Moore-Penrose generalized inverse, a new additive trace is introduced on the restriction of this category to isometries, which trace is carried over to directed quantum Turing machines as monoidal automata. The JoyalStreet-Verity Int construction is then used to extend this structure to a reversible bidirectional one.
منابع مشابه
On Quantum Pushdown Automata
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of quantum pushdown automata in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitarity criteria of quantum pushdown automata are not equiv...
متن کاملLanguages Recognized with Unbounded Error by Quantum Finite Automata
We prove the following facts about the language recognition power of Kondacs-Watrous quantum finite automata in the unbounded error setting: One-way automata of this kind recognize all and only the stochastic languages. When the tape head is allowed two-way (or even " 1.5-way ") movement, more languages become recognizable. This leads to the conclusion that quantum Turing machines are more powe...
متن کاملOn One-Dimensional Quantum Cellular Automata
Since Richard Feynman introduced the notion of quantum computation in 1982, various models of \quantum computers" have been proposed. These models include quantum Turing machines and quantum circuits. In this paper we deene another quantum computational model, one-dimensional quantum cellular automata, and demonstrate that any quantum Turing machine can be eeciently simulated by a one-dimension...
متن کاملQuantum Pushdown Automata
Quantum finite automata, as well as quantum pushdown automata (QPA) were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of QPA in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitarity criteria of QPA are not equivalent to the corresponding unitarity c...
متن کاملQuantum machines with classical control
Herein we survey the main results concerning quantum automata and machines with classical control. These machines were originally proposed by Sernadas et al in [37], during the FCT QuantLog project. First, we focus on the expressivity of quantum automata with both quantum and classical states. We revise the result obtained in [32] where it was proved that such automata are able to recognise, wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012